Scheduling Agents - Distributed Timetabling Problems(DisTTP)

Distributed University Timetabling with Multiply Sectioned Constraint Networks

Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...

Distributed personnel scheduling - negotiation among scheduling agents

This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) paradigm. The architecture is composed of a set of autonomous software Scheduling Agents (SAs) that solve the Employee Timetabling Problems (ETP) for each department. Each agent has its own local ETP problem and its own...

Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

Negotiation among Scheduling Agents for Distributed Timetabling

A Language for Specifying Complete Timetabling Problems

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a number of different versions of the timetabling problem. These include school timetabling (where students are grouped in classes with similar degree plans), university timetabling (where students are considered individu...